Constructions of Involutions Over Finite Fields
نویسندگان
چکیده
منابع مشابه
Constructions of Subsystem Codes over Finite Fields
Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. Subsystem codes generalize all major quantum error protection schemes, and therefore are especially versatile. This paper introduces numerous constructions of subsystem codes. It is shown how one can derive subsystem codes from classical cyclic codes. Methods to trade the dim...
متن کاملExplicit formulas for monomial involutions over finite fields
Francis Castro, Carlos Corrada, Natalia Pacheco∗, Ivelisse Rubio, University of Puerto Rico, Ŕıo Piedras Permutations of finite fields have important applications in cryptography and coding theory. Involutions are permutations that are its own inverse and are of particular interest because the implementation used for coding can also be used for decoding. We present explicit formulas for all the...
متن کاملTests and Constructions of Irreducible Polynomials over Finite Fields
In this paper we focus on tests and constructions of irreducible polynomials over nite elds. We revisit Rabin's (1980) algorithm providing a variant of it that improves Rabin's cost estimate by a log n factor. We give a precise analysis of the probability that a random polynomial of degree n contains no irreducible factors of degree less than O(log n). This probability is naturally related to B...
متن کاملStructures and Constructions of Subsystem Codes over Finite Fields
Quantum information processing is a rapidlymounting field that promises to accelerate the speed up ofcomputations. The field utilizes the novel fundamental rules ofquantum mechanics such as accelerations. Quantum states carry-ing quantum information are tempted to noise and decoherence,that’s why the field of quantum error control comes. In thispaper, we investigate vari...
متن کاملConstructions of optimal LCD codes over large finite fields
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2919511